0.12/0.12	% Problem    : Vampire---4.8_6086 : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n015.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1440
0.14/0.35	% WCLimit    : 180
0.14/0.35	% DateTime   : Mon Jul  3 13:25:10 EDT 2023
0.14/0.35	% CPUTime    : 
0.21/0.48	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.o6AQXVWb2S/Vampire---4.8_6086
0.21/0.49	# Version: 3.1pre001-ho
0.21/0.50	# Preprocessing class: HSSSSMSSSSSNHHA.
0.21/0.50	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.50	# Starting sh2lt with 720s (4) cores
0.21/0.50	# Starting new_ho_10_unif with 180s (1) cores
0.21/0.50	# Starting full_lambda_6 with 180s (1) cores
0.21/0.50	# Starting post_as_ho1 with 180s (1) cores
0.21/0.50	# Starting ehoh_best3_rw with 180s (1) cores
0.21/0.50	# full_lambda_6 with pid 6421 completed with status 0
0.21/0.50	# Result found by full_lambda_6
0.21/0.50	# Preprocessing class: HSSSSMSSSSSNHHA.
0.21/0.50	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.50	# Starting sh2lt with 720s (4) cores
0.21/0.50	# Starting new_ho_10_unif with 180s (1) cores
0.21/0.50	# Starting full_lambda_6 with 180s (1) cores
0.21/0.50	# SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
0.21/0.50	# Search class: HGUSF-FFSF11-DHHFFMBN
0.21/0.50	# partial match(1): HGUSF-FFSF11-SHHFFMBN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.21/0.50	# Starting ho_unfolding_3 with 98s (1) cores
0.21/0.50	# ho_unfolding_3 with pid 6425 completed with status 0
0.21/0.50	# Result found by ho_unfolding_3
0.21/0.50	# Preprocessing class: HSSSSMSSSSSNHHA.
0.21/0.50	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.21/0.50	# Starting sh2lt with 720s (4) cores
0.21/0.50	# Starting new_ho_10_unif with 180s (1) cores
0.21/0.50	# Starting full_lambda_6 with 180s (1) cores
0.21/0.50	# SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
0.21/0.50	# Search class: HGUSF-FFSF11-DHHFFMBN
0.21/0.50	# partial match(1): HGUSF-FFSF11-SHHFFMBN
0.21/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.21/0.50	# Starting ho_unfolding_3 with 98s (1) cores
0.21/0.50	# Preprocessing time       : 0.001 s
0.21/0.50	# Presaturation interreduction done
0.21/0.50	
0.21/0.50	# Proof found!
0.21/0.50	# SZS status Theorem
0.21/0.50	# SZS output start CNFRefutation
0.21/0.50	thf(decl_22, type, epred1_0: (a > a > $o) > $o).
0.21/0.50	thf(decl_23, type, epred2_0: (a > a > $o) > $o).
0.21/0.50	thf(decl_24, type, esk1_0: a).
0.21/0.50	thf(decl_25, type, esk2_0: a).
0.21/0.50	thf(decl_26, type, esk3_1: (a > a > $o) > a).
0.21/0.50	thf(decl_27, type, esk4_1: (a > a > $o) > a).
0.21/0.50	thf(decl_28, type, epred3_1: (a > a > $o) > a > a > $o).
0.21/0.50	thf(decl_29, type, epred4_0: a > a > $o).
0.21/0.50	thf(decl_30, type, epred5_3: a > a > (a > a > $o) > a > a > $o).
0.21/0.50	thf(cTHM254_A_pme, conjecture, ![X1:(a > a > $o) > $o, X2:(a > a > $o) > $o, X3:a, X4:a]:((![X5:a > a > $o]:(((X5 @ X3 @ X4)<=(![X6:a, X7:a]:((?[X8:a > a > $o]:(((X8 @ X6 @ X7)&?[X9:a > a > $o]:((((X8)=(^[X10:a, X11:a]:(![X12:a > a > $o]:(((![X13:a, X14:a]:(((X9 @ X13 @ X14)=>(X12 @ X13 @ X14)))&(X1 @ X12))=>(X12 @ X10 @ X11))))))&(X2 @ X9)))))=>(X5 @ X6 @ X7)))&(X1 @ X5))))<=![X5:a > a > $o]:((((X1 @ X5)&![X6:a, X7:a]:(((X5 @ X6 @ X7)<=?[X8:a > a > $o]:(((X2 @ X8)&(X8 @ X6 @ X7))))))=>(X5 @ X3 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.o6AQXVWb2S/Vampire---4.8_6086', cTHM254_A_pme)).
0.21/0.50	thf(c_0_1, negated_conjecture, ~(![X1:(a > a > $o) > $o, X2:(a > a > $o) > $o, X3:a, X4:a]:((![X5:a > a > $o]:((((X1 @ X5)&![X6:a, X7:a]:((?[X8:a > a > $o]:(((X2 @ X8)&(X8 @ X6 @ X7)))=>(X5 @ X6 @ X7))))=>(X5 @ X3 @ X4)))=>![X5:a > a > $o]:(((![X6:a, X7:a]:((?[X8:a > a > $o]:(((X8 @ X6 @ X7)&?[X9:a > a > $o]:((((X8)=(^[Z0/* 19 */:a, Z1:a]:(![X12:a > a > $o]:(((![X13:a, X14:a]:(((X9 @ X13 @ X14)=>(X12 @ X13 @ X14)))&(X1 @ X12))=>(X12 @ Z0 @ Z1))))))&(X2 @ X9)))))=>(X5 @ X6 @ X7)))&(X1 @ X5))=>(X5 @ X3 @ X4)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM254_A_pme])])])).
0.21/0.50	thf(c_0_2, negated_conjecture, ![X32:a > a > $o, X37:a, X38:a, X39:a > a > $o, X40:a > a > $o]:((((((epred2_0 @ (epred3_1 @ X32))|~(epred1_0 @ X32)|(X32 @ esk1_0 @ esk2_0))&((epred3_1 @ X32 @ (esk3_1 @ X32) @ (esk4_1 @ X32))|~(epred1_0 @ X32)|(X32 @ esk1_0 @ esk2_0)))&(~(X32 @ (esk3_1 @ X32) @ (esk4_1 @ X32))|~(epred1_0 @ X32)|(X32 @ esk1_0 @ esk2_0)))&(((~(X39 @ X37 @ X38)|(((X39)!=(^[Z0/* 19 */:a, Z1:a]:(![X12:a > a > $o]:(((![X13:a, X14:a]:(((X40 @ X13 @ X14)=>(X12 @ X13 @ X14)))&(epred1_0 @ X12))=>(X12 @ Z0 @ Z1))))))|~(epred2_0 @ X40))|(epred4_0 @ X37 @ X38))&(epred1_0 @ epred4_0))&~(epred4_0 @ esk1_0 @ esk2_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.21/0.50	thf(c_0_3, negated_conjecture, ![X3:a, X4:a, X5:a > a > $o, X9:a > a > $o]:(((epred4_0 @ X3 @ X4)|~((X5 @ X3 @ X4))|((X5)!=(^[Z0/* 19 */:a, Z1:a]:(![X50:a > a > $o]:(((![X51:a, X52:a]:(((X9 @ X51 @ X52)=>(X50 @ X51 @ X52)))&(epred1_0 @ X50))=>(X50 @ Z0 @ Z1))))))|~((epred2_0 @ X9)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_4, negated_conjecture, ![X3:a, X4:a, X5:a > a > $o]:(((epred4_0 @ X3 @ X4)|~(![X53:a > a > $o]:(((![X54:a, X55:a]:(((X5 @ X54 @ X55)=>(X53 @ X54 @ X55)))&(epred1_0 @ X53))=>(X53 @ X3 @ X4))))|~((epred2_0 @ X5)))), inference(er,[status(thm)],[c_0_3])).
0.21/0.50	thf(c_0_5, negated_conjecture, ![X5:a > a > $o]:(((epred3_1 @ X5 @ (esk3_1 @ X5) @ (esk4_1 @ X5))|(X5 @ esk1_0 @ esk2_0)|~((epred1_0 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_6, negated_conjecture, (epred1_0 @ epred4_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_7, negated_conjecture, ~((epred4_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_8, negated_conjecture, ![X5:a > a > $o]:(((epred2_0 @ (epred3_1 @ X5))|(X5 @ esk1_0 @ esk2_0)|~((epred1_0 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_9, negated_conjecture, ![X3:a, X4:a, X7:a, X6:a, X5:a > a > $o]:(((epred5_3 @ X3 @ X4 @ X5 @ X6 @ X7)|(epred4_0 @ X3 @ X4)|~((X5 @ X6 @ X7))|~((epred2_0 @ X5)))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
0.21/0.50	thf(c_0_10, negated_conjecture, (epred3_1 @ epred4_0 @ (esk3_1 @ epred4_0) @ (esk4_1 @ epred4_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])).
0.21/0.50	thf(c_0_11, negated_conjecture, (epred2_0 @ (epred3_1 @ epred4_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_6]), c_0_7])).
0.21/0.50	thf(c_0_12, negated_conjecture, ![X5:a > a > $o]:(((X5 @ esk1_0 @ esk2_0)|~((X5 @ (esk3_1 @ X5) @ (esk4_1 @ X5)))|~((epred1_0 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.21/0.50	thf(c_0_13, negated_conjecture, ![X3:a, X4:a]:(((epred5_3 @ X3 @ X4 @ (epred3_1 @ epred4_0) @ (esk3_1 @ epred4_0) @ (esk4_1 @ epred4_0))|(epred4_0 @ X3 @ X4))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])])).
0.21/0.50	thf(c_0_14, negated_conjecture, ![X3:a, X4:a, X5:a > a > $o]:(((epred4_0 @ X3 @ X4)|~((epred5_3 @ X3 @ X4 @ X5 @ X3 @ X4))|~((epred2_0 @ X5)))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
0.21/0.50	thf(c_0_15, negated_conjecture, (epred5_3 @ (esk3_1 @ epred4_0) @ (esk4_1 @ epred4_0) @ (epred3_1 @ epred4_0) @ (esk3_1 @ epred4_0) @ (esk4_1 @ epred4_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_6])]), c_0_7])).
0.21/0.50	thf(c_0_16, negated_conjecture, (epred4_0 @ (esk3_1 @ epred4_0) @ (esk4_1 @ epred4_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_11])])).
0.21/0.50	thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_16]), c_0_6])]), c_0_7]), ['proof']).
0.21/0.50	# SZS output end CNFRefutation
0.21/0.50	# Parsed axioms                        : 2
0.21/0.50	# Removed by relevancy pruning/SinE    : 1
0.21/0.50	# Initial clauses                      : 6
0.21/0.50	# Removed in clause preprocessing      : 0
0.21/0.50	# Initial clauses in saturation        : 6
0.21/0.50	# Processed clauses                    : 43
0.21/0.50	# ...of these trivial                  : 0
0.21/0.50	# ...subsumed                          : 0
0.21/0.50	# ...remaining for further processing  : 43
0.21/0.50	# Other redundant clauses eliminated   : 1
0.21/0.50	# Clauses deleted for lack of memory   : 0
0.21/0.50	# Backward-subsumed                    : 0
0.21/0.50	# Backward-rewritten                   : 0
0.21/0.50	# Generated clauses                    : 47
0.21/0.50	# ...of the previous two non-redundant : 44
0.21/0.50	# ...aggressively subsumed             : 0
0.21/0.50	# Contextual simplify-reflections      : 0
0.21/0.50	# Paramodulations                      : 27
0.21/0.50	# Factorizations                       : 0
0.21/0.50	# NegExts                              : 5
0.21/0.50	# Equation resolutions                 : 1
0.21/0.50	# Total rewrite steps                  : 6
0.21/0.50	# Propositional unsat checks           : 0
0.21/0.50	#    Propositional check models        : 0
0.21/0.50	#    Propositional check unsatisfiable : 0
0.21/0.50	#    Propositional clauses             : 0
0.21/0.50	#    Propositional clauses after purity: 0
0.21/0.50	#    Propositional unsat core size     : 0
0.21/0.50	#    Propositional preprocessing time  : 0.000
0.21/0.50	#    Propositional encoding time       : 0.000
0.21/0.50	#    Propositional solver time         : 0.000
0.21/0.50	#    Success case prop preproc time    : 0.000
0.21/0.50	#    Success case prop encoding time   : 0.000
0.21/0.50	#    Success case prop solver time     : 0.000
0.21/0.50	# Current number of processed clauses  : 30
0.21/0.50	#    Positive orientable unit clauses  : 6
0.21/0.50	#    Positive unorientable unit clauses: 0
0.21/0.50	#    Negative unit clauses             : 1
0.21/0.50	#    Non-unit-clauses                  : 23
0.21/0.50	# Current number of unprocessed clauses: 14
0.21/0.50	# ...number of literals in the above   : 51
0.21/0.50	# Current number of archived formulas  : 0
0.21/0.50	# Current number of archived clauses   : 12
0.21/0.50	# Clause-clause subsumption calls (NU) : 37
0.21/0.50	# Rec. Clause-clause subsumption calls : 27
0.21/0.50	# Non-unit clause-clause subsumptions  : 0
0.21/0.50	# Unit Clause-clause subsumption calls : 4
0.21/0.50	# Rewrite failures with RHS unbound    : 0
0.21/0.50	# BW rewrite match attempts            : 3
0.21/0.50	# BW rewrite match successes           : 0
0.21/0.50	# Condensation attempts                : 43
0.21/0.50	# Condensation successes               : 0
0.21/0.50	# Termbank termtop insertions          : 2664
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.009 s
0.21/0.50	# System time              : 0.001 s
0.21/0.50	# Total time               : 0.010 s
0.21/0.50	# Maximum resident set size: 1896 pages
0.21/0.50	
0.21/0.50	# -------------------------------------------------
0.21/0.50	# User time                : 0.009 s
0.21/0.50	# System time              : 0.004 s
0.21/0.50	# Total time               : 0.013 s
0.21/0.50	# Maximum resident set size: 1728 pages
0.21/0.50	% E---3.1 exiting
0.21/0.50	EOF